Percolation and Connectivity in the Intrinsically Secure Communications Graph
نویسندگان
چکیده
منابع مشابه
Secure Communication in Shotgun Cellular Systems
In this paper, we analyze the secure connectivity in Shotgun cellular systems (SCS: Wireless communication systems with randomly placed base stations) by Poisson intrinsically secure communication graph (IS-graph), i.e., a random graph which describes the connections that are secure over a network. For a base-station in SCS, a degree of secure connections is determined over two channel models: ...
متن کاملthe role of teachers explicit corrective feedback in grammar learning of the intrinsically and the extrinsically motivated advanced english female learners
در تحقیق حاضر تلاش شد تا از سویی رابطه بین تصحیح مستقیم خطاهای گرامری زبان آموزان توسط معلم بررسی شود و از سوی دیگر رابطه میان این تصحیح ها و انگیزه زبان آموز مورد بررسی قرار گیرد. به این منظور تعداد 45 زبان آموز دختر سطح پیشرفته در نظر گرفته شد که بعد از جمع آوری پرسش نامه هایی در ارتباط با انگیزه آنه نسبت به یادگیری زبان انگلیسی 20 نفر از آنها در گروه انگیزه درونی و 15 نفر در گروه انگیزه بیرو...
15 صفحه اولOn the Szeged and Eccentric connectivity indices of non-commutative graph of finite groups
Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...
متن کاملPercolation in the k-nearest neighbor graph
Let P be a Poisson process of intensity one in R2. For a fixed integer k, join every point of P to its k nearest neighbors, creating a directed random geometric graph ~ Gk(R). We prove bounds on the values of k that, almost surely, result in an infinite connected component in ~ Gk(R) for various definitions of “component”. We also give high confidence results for the exact values of k needed. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2173726